Analytic Loss Minimization: A Proof

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Proof Method of Analytic Inequality

This paper gives a new proof method of analytic inequality involving n variables. As its Applications, we proved some well-known inequalities and improved the Carleman-Inequality. 1. monotonicity on special region Throughout the paper R denotes the set of real numbers and R+ denotes the set of strictly positive real numbers, n ∈ N, n ≥ 2. In this section, we shall provide a new proof method of ...

متن کامل

Efficient Coverability Analysis by Proof Minimization

We consider multi-threaded programs with an unbounded number of threads executing a finite-state, non-recursive procedure. Safety properties of such programs can be checked via reduction to the coverability problem for wellstructured transition systems (WSTS). In this paper, we present a novel, sound and complete yet empirically much improved solution to this problem. The key idea to achieve a ...

متن کامل

Minimization of Information Loss through

In this article, we explore the concept of minimization of information loss (MIL) as a a target for neural network learning. We relate MIL to supervised and unsupervised learning procedures such as the Bayesian maximum a-posteriori (MAP) discriminator, minimization of distortion measures such as mean squared error (MSE) and cross-entropy (CE), and principal component analysis (PCA). To deal wit...

متن کامل

Sign-Constrained Regularized Loss Minimization

In practical analysis, domain knowledge about analysis target has often been accumulated, although, typically, such knowledge has been discarded in the statistical analysis stage, and the statistical tool has been applied as a black box. In this paper, we introduce sign constraints that are a handy and simple representation for non-experts in generic learning problems. We have developed two new...

متن کامل

Loss Minimization in Parse Reranking

We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approaches to expected loss approximation are considered, including estimating from the probabilistic model used to generate the candidates, estimating from a discriminative model trained to rerank the candidates, and learnin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Power Systems

سال: 2016

ISSN: 0885-8950,1558-0679

DOI: 10.1109/tpwrs.2015.2479408